Para-Graph: Graph-Based Parameterization of Triangle Meshes with Arbitrary Genus

نویسندگان

  • Giuseppe Patanè
  • Michela Spagnuolo
  • Bianca Falcidieno
چکیده

This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is computed and used to segment the shape into primitives, which define a chart decomposition of the mesh. Then, each chart is parameterized using an extension of the barycentric coordinates method. The charts are all 0-genus and can be of three types only, depending on the number of boundary components. The chart decomposition and the parameterization are used to define a shape graph where each node represents one primitive and the arcs code the adjacency relationships between the primitives. Conical and cylindrical primitives are coded together with their skeletal lines that are computed from and aligned with their parameterization. The application of the parameterization approach to remeshing guarantees that extraordinary vertices are localized only where two patches share a boundary and they are not scattered on the whole surface.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Families of cut-graphs for bordered meshes with arbitrary genus

Given a triangulated surface M with arbitrary genus, the set of its cut-graphs depends on the underlying topology and the selection of a specific one should be guided by the surface geometry and targeted applications. Most of the previous work on this topic uses mesh traversal techniques for the evaluation of the geodesic metric, and therefore the cut-graphs are influenced by the mesh connectiv...

متن کامل

One-Forms on Meshes and Applications to 3D Mesh Parameterization

We develop a theory of one-forms on meshes. The theory culminates in a discrete analog of the Poincare-Hopf index theorem for meshes. We apply this theorem to obtain some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte's celebrated "spring-embedding" theorem for planar graphs, which is widely used for parameterizing meshes with the...

متن کامل

Mesh reconstruction by meshless denoising and parameterization

We present a new approach to simultaneously denoise and parameterize unorganized point cloud data. This is achieved by minimizing an appropriate energy function defined on the point cloud and its parameterization. An iterative algorithm to minimize the energy is described. The key ingredient of our approach is an “as-rigid-as-possible” meshless parameterization to map a point cloud with disk to...

متن کامل

Computing the Reeb Graph for Triangle Meshes with Active Contours

This paper illustrates a novel method to compute the Reeb graph for triangle meshes. The algorithm is based on the definition of discrete, active contours as counterparts of continuous level lines. Active contours are made up of edges and vertices with multiple presence and implicitly maintain a faithful representation of the level lines, even in case of coarse meshes with higher genus. This ap...

متن کامل

Subdivision Tree Representation of Arbitrary Triangle Meshes

We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary triangle mesh into a small set of normal meshes. The subdivision tree representation can be used to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2004